منابع مشابه
Logic Synthesis via Hamming Clustering
The synthesis of digital circuits for the solution of binary classification problems is performed by employing a new learning method, named Hamming Clustering: it proceeds by generating clusters of input patterns that belong to the same class and are close each other according to the Hamming distance. In polynomial time, a digital circuit is obtained, neglecting redundant inputs irrelevant to t...
متن کاملThe Second Generalized Hamming Weight of the Dual Codes of Double-error Correcting Binary Bch-codes
In this note we determine the second generalized Hamming weight of the dual codes of binary doubleerror correcting BCH-codes.
متن کاملBinary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expression associated with any Boolean function from a training set of samples. The basic kernel of the method is the generation of clusters of input patterns that belong to the same class and are close to each other according ...
متن کاملGolay Codes
We discuss a specific type of error-control coding using Golay codes. First we introduce the basics of coding. Then we discuss the Golay code in binary form, extended binary form, and ternary form.
متن کاملGolay-Littlewood Problem
Identifying binary sequences {} whose autocorrelations {} are jointly as small as possible, for fixed , is important for engineering design purposes. The “best” sequences are those with the largest merit factor . As an example, the sequence 1−1 1−1 1 1−1−1 1 1 1 1 1 has the largest value 16912 = 140833 among all such with = 12. As another example, the sequence 1−1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2000
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(00)00114-0